On the computational complexity of partial covers of Theta graphs ? Jiˇr´ı Fiala a , Jan Kratochv´ıl a , Atilla P´or a,b a Department of Applied Mathematics and

Source URL: iti.mff.cuni.cz

Introduction to microarray analysis Ricardo de Matos Simões and Frank Emmert-Streib Computational Biology and Machine Learning Center for Cancer Research and Cell Biology Queen’s University Belfast, UK

Source URL: www.bio-complexity.com

Effective Strong Dimension in Algorithmic Information and Computational Complexity Krishna B. Athreya 1

Source URL: www.cs.uwyo.edu

Midterm Computational Complexity March 23, 2009 You are not allowed to collaborate or refer to any book or

Source URL: ftp.cs.nyu.edu

Algorithmic Game Theory∗ Tim Roughgarden† May 12, 2009 1

Source URL: theory.stanford.edu

• Game theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Algorithmic game theory
• Price of anarchy
• Algorithmic mechanism design
• Mechanism design
• Approximation algorithm
• PPAD
• Epsilon-equilibrium
• Computational complexity theory

On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson

Source URL: highlights-conference.org

• Complexity classes
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Computational complexity theory
• Computer science
• Boolean circuit
• Logic in computer science
• NC
• P
• Circuit
• FO

Communication Optimal Parallel Multiplication of Sparse Random Matrices∗ Grey Ballard Aydın Buluç

Source URL: gauss.cs.ucsb.edu

• Multiplication
• Matrix theory
• Numerical linear algebra
• Matrix multiplication algorithm
• Analysis of algorithms
• Computational complexity theory
• Matrix multiplication
• Matrix
• Parallel computing
• Multiplication algorithm
• Algorithm
• Time complexity

2015 Knuth Prize Citation for L´ aszl´ o Babai The 2015 Donald E. Knuth Prize is awarded to L´aszl´o Babai of the University of Chicago for his fundamental contributions to theoretical computer science, including alg

Source URL: www.sigact.org

• Probabilistic complexity theory
• Theoretical computer science
• Morphisms
• Computational complexity theory
• PCP theorem
• Mathematical optimization
• Probabilistically checkable proof
• Combinatorica
• IP
• Algorithm
• Russell Impagliazzo
• Graph isomorphism

c Cambridge University Press 2011 Math. Struct. in Comp. Science (2011), vol. 21, pp. 1339–1362.
doi:S0960129511000223 On the computational complexity of dynamic slicing problems for program schemas

Source URL: sebastian.doc.gold.ac.uk

Intersection Types and Computational Complexity Simona Ronchi Della Rocca

Source URL: www.pps.univ-paris-diderot.fr